compiling algorithm meaning in Chinese

编译算法

Based on the timing constraints event model of rtl ( real time logic ) , the compiling algorithms for timing constraints event transform the problem of how to detect timing constraints event to the problem of how to find negative cycle in weighted directed graph , which is named as constraints graph . by simplifying constraints graph , the efficient detecting algorithms for timing constraints event have been developed , which not only has good time complexity but also can find events that violate timing constraints as early as possible . in order to verify the event detecting methods based on dynamic rules and to check its efficiency in application , experiment schemes are designed and performed on the implemented prototype system in linux environment
带时间约束事件的编译算法以rtl ( realtimelogic )事件模型为基础，将带时间约束事件的检测转化为在带权值的有向图(此即受限图)中寻找负圈的问题，它通过化简受限图得到最小有效约束集；运行时事件检测算法在最小有效约束集上检查事件的时间约束，不但有较好的执行效率，而且能尽早地发现违反时间约束的事件。